On Join Operation of Graphs by Obtained Monogenic Semigroups
نویسندگان
چکیده
منابع مشابه
Classification of Monogenic Ternary Semigroups
The aim of this paper is to classify all monogenic ternary semigroups, up to isomorphism. We divide them to two groups: finite and infinite. We show that every infinite monogenic ternary semigroup is isomorphic to the ternary semigroup O, the odd positive integers with ordinary addition. Then we prove that all finite monogenic ternary semigroups with the same index...
متن کاملSpectra of graphs obtained by a generalization of the join graph operation
Taking a Fiedler’s result [1] on the spectrum of a matrix formed from two symmetric matrices as a motivation, a more general result is deduced and applied to the determination of adjacency and Laplacian spectra of graphs obtained by a generalized join graph operation on families of graphs (regular in the case of adjacency spectra and arbitrary in the case of Laplacian spectra). Some additional ...
متن کاملJoin irreducible semigroups
We begin a systematic study of those finite semigroups that generate join irreducible members of the lattice of pseudovarieties of finite semigroups, which are important for the spectral theory of this lattice. Finite semigroups S that generate join irreducible pseudovari-eties are characterized as follows: whenever S divides a direct product A × B of finite semigroups, then S divides either A ...
متن کاملOn the Graphs Related to Green Relations of Finite Semigroups
In this paper we develop an analog of the notion of the con- jugacy graph of nite groups for the nite semigroups by considering the Green relations of a nite semigroup. More precisely, by de ning the new graphs $Gamma_{L}(S)$, $Gamma_{H}(S)$, $Gamma_{J}(S)$ and $Gamma_{D}(S)$ (we name them the Green graphs) related to the Green relations L R J H and D of a nite semigroup S , we first atte...
متن کاملThe locating chromatic number of the join of graphs
Let $f$ be a proper $k$-coloring of a connected graph $G$ and $Pi=(V_1,V_2,ldots,V_k)$ be an ordered partition of $V(G)$ into the resulting color classes. For a vertex $v$ of $G$, the color code of $v$ with respect to $Pi$ is defined to be the ordered $k$-tuple $c_{{}_Pi}(v)=(d(v,V_1),d(v,V_2),ldots,d(v,V_k))$, where $d(v,V_i)=min{d(v,x):~xin V_i}, 1leq ileq k$. If distinct...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Turkish Journal of Mathematics and Computer Science
سال: 2021
ISSN: 2148-1830
DOI: 10.47000/tjmcs.756323